The Erdös-rado Arrow for Singular
نویسنده
چکیده
We prove that if cf(λ) > א0 and 2 cf(λ) < λ then λ → (λ, ω + 1) in ZFC
منابع مشابه
Erdös-Ko-Rado theorems for chordal and bipartite graphs
One of the more recent generalizations of the Erdös-Ko-Rado theorem, formulated by Holroyd, Spencer and Talbot [10], de nes the Erdös-Ko-Rado property for graphs in the following manner: for a graph G, vertex v ∈ G and some integer r ≥ 1, denote the family of independent r-sets of V (G) by J (r)(G) and the subfamily {A ∈ J (r)(G) : v ∈ A} by J (r) v (G), called a star. Then, G is said to be r-E...
متن کاملOn large deviation properties of Erdös-Rényi random graphs
It is well-known that typical properties of random graphs can be derived from the q → 1 limit of the Potts model of statistical mechanics. We show that, additionally, the Legendre transform of the Potts free energy with respect to ln q allows to study large deviation properties of the random graph ensemble characterizing graphs with an atypical number of components. We also demonstrate how the ...
متن کاملArrow theorems in the fuzzy setting
Throughout this paper, our main idea is to analyze the Arrovian approach in a fuzzy context, paying attention to different extensions of the classical Arrow's model arising in mathematical Social Choice to aggregate preferences that the agents define on a set of alternatives. There is a wide set of extensions. Some of them give rise to an impossibility theorem as in the Arrovian classical mod...
متن کاملRadner Equilibria under Ambiguous Volatility
The present paper considers a class of general equilibrium economies when the primitive uncertainty model features uncertainty about continuous-time volatility. This requires a set of mutually singular priors, which do not share the same null sets. For this setting we introduce an appropriate commodity space and the dual of linear and continuous price systems. All agents in the economy are hete...
متن کاملAn Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
In this paper, aiming at solving the bidiagonal SVD problem, a classical divide-andconquer (DC) algorithm is modified, which needs to compute the SVD of broken arrow matrices by solving secular equations. The main cost of DC lies in the updating of singular vectors, which involves two matrix-matrix multiplications. We find that the singular vector matrices of a broken arrow matrix are Cauchy-li...
متن کامل